Irreducible Toeplitz and Hankel matrices
نویسندگان
چکیده
An infinite matrix is called irreducible if its directed graph is strongly connected. It is proved that an infinite Toeplitz matrix is irreducible if and only if almost every finite leading submatrix is irreducible. An infinite Hankel matrix may be irreducible even if all its finite leading submatrices are reducible. Irreducibility results are also obtained in the finite cases.
منابع مشابه
Transformation Techniques for Toeplitz and Toeplitz-plus-Hankel Matrices. I. Transformations
Transformations of the form A + E’FAg2 are investigated that transform Toeplitz and Toeplitz-plus-Hankel matrices into generalized Cauchy matrices. ‘Zi and @a are matrices related to the discrete Fourier transformation or to various real trigonometric transformations. Combining these results with pivoting techniques, in paper II algorithms for Toeplitz and Toeplitz-plus-Hankel systems will be p...
متن کاملTransformation Techniques for Toeplitz and Toeplitz-plus-hankel Matrices Part I. Transformations
Transformations of the form A ! C 1 AC 2 are investigated that transform Toeplitz and Toeplitz-plus-Hankel matrices into generalized Cauchy matrices. C 1 and C 2 are matrices related to the discrete Fourier transformation or to various real trigonometric transformations. Combining these results with pivoting techniques,in part II algorithmsfor Toeplitz and Toeplitz-plus-Hankel systems will be p...
متن کاملEvery Matrix is a Product of Toeplitz Matrices
We show that every n × n matrix is generically a product of n/2 + 1 Toeplitz matrices and always a product of at most 2n + 5 Toeplitz matrices. The same result holds true if the word ‘Toeplitz’ is replaced by ‘Hankel,’ and the generic bound n/2 + 1 is sharp. We will see that these decompositions into Toeplitz or Hankel factors are unusual: We may not, in general, replace the subspace of Toeplit...
متن کاملSplit Algorithms and ZW-Factorization for Toeplitz and Toeplitz-plus-Hankel Matrices
New algorithms for Toeplitz and Toeplitz-plus-Hankel are presented that are in the spirit of the “split” algorithms of Delsarte/Genin. It is shown that the split algorithms are related to ZW-factorizations like the classical algorithms are related to LU-factorizations. Special attention is paid to skewsymmetric Toeplitz, centrosymmetric Toeplitz-plus-Hankel and general Toeplitz-plus-Hankel matr...
متن کاملTransformation Techniques for Toeplitz and Toeplitz-plus-hankel Matrices Part Ii. Algorithms
In the rst part 13] of the paper transformationsmappingToeplitz and Toeplitz-plus-Hankel matrices into generalizedCauchy matrices were studied. In this second part fast algorithms for LU-factorization and inversion of generalized Cauchy matrices are discussed. It is shown that the combinationof transformation pivoting techniques leads to algorithms for indeenite Toeplitz and Toeplitz-plus-Hanke...
متن کامل